Recognition Algorithm Design and Complex Analysis for Languages of S-Nets
نویسندگان
چکیده
منابع مشابه
lexical decomposition awareness and its effect on delayed receptive and productive recognition and recall of vocabulary knowledge of morphologically complex english words: an iranian efl context
abstract lexical knowledge of complex english words is an important part of language skills and crucial for fluent language use (nation, 2001). the present study, thus, was an attempt to assess the role of morphological decomposition awareness as a vocabulary learning strategy on learners’ productive and receptive recall and recognition of complex english words. so 90 sophomores (female and ma...
15 صفحه اولNETS AND SEPARATED S-POSETS
Nets, useful topological tools, used to generalize certainconcepts that may only be general enough in the context of metricspaces. In this work we introduce this concept in an $S$-poset, aposet with an action of a posemigroup $S$ on it whichis a very useful structure in computer sciences and interestingfor mathematicians, and give the the concept of $S$-net. Using $S$-nets and itsconvergency we...
متن کاملsimulation and design of electronic processing circuit for restaurants e-procurement system
the poor orientation of the restaurants toward the information technology has yet many unsolved issues in regards to the customers. one of these problems which lead the appeal list of later, and have a negative impact on the prestige of the restaurant is the case when the later does not respond on time to the customers’ needs, and which causes their dissatisfaction. this issue is really sensiti...
15 صفحه اولRecognition Algorithm for Mildly Context-Sensitive Languages
Vijay-Shanker and Weir have shown in 19] that Tree Adjoining Grammars and Combinatory Categorial Grammars can be transformed into equivalent Linear Indexed Grammars (LIGs) which can be recognized in O(n 6) time using a Cocke-Kasami-Younger style algorithm. This paper exhibits another recognition algorithm for LIGs, with the same upper-bound complexity, but whose average case behaves much better...
متن کاملanalysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2010
ISSN: 1812-5638
DOI: 10.3923/itj.2011.106.112